On computational complexity of Cremer Julia sets
نویسندگان
چکیده
منابع مشابه
On computational complexity of Siegel Julia sets
It is known that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.
متن کاملMonotone Images of Cremer Julia Sets
We show that if P is a quadratic polynomial with a fixed Cremer point and Julia set J , then for any monotone map φ : J → A from J onto a locally connected continuum A, A is a
متن کاملThe Solar Julia Sets of Basic Quadratic Cremer Polynomials
In general, little is known about the exact topological structure of Julia sets containing a Cremer point. In this paper we show that there exist quadratic Cremer Julia sets of positive area such that for a full Lebesgue measure set of angles the impressions are degenerate, the Julia set is connected im kleinen at the landing points of these rays, and these points are contained in no other impr...
متن کاملComputational Complexity of Euclidean Sets : Hyperbolic Julia Sets are Poly - Time Computable
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman Master of Science Graduate Department of Computer Science University of Toronto 2004 We investigate different definitions of the computability and complexity of sets in R, and establish new connections between these definitions. This allows us to connect the computability of real functions ...
متن کاملOn Biaccessible Points in the Julia Setof a Cremer Quadratic
We prove that the only possible biaccessible points in the Julia set of a Cremer quadraticpolynomialare the Cremer xed point and its preimages. This gives a partial answer to a question posed by C. McMullen on whether such a Julia set can contain any biaccessible point at all.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2021
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm829-12-2019